Boolean Equi-propagation for Optimized SAT Encoding
نویسندگان
چکیده
We present an approach to propagation based solving, Boolean equi-propagation, where constraints are modelled as propagators of information about equalities between Boolean literals. Propagation based solving applies this information as a form of partial evaluation resulting in optimized SAT encodings. We demonstrate for a variety of benchmarks that our approach results in smaller CNF encodings and leads to speed-ups in solving times.
منابع مشابه
Boolean Equi-propagation for Concise and Efficient SAT Encodings of Combinatorial Problems
We present an approach to propagation-based SAT encoding of combinatorial problems, Boolean equi-propagation, where constraints are modeled as Boolean functions which propagate information about equalities between Boolean literals. This information is then applied to simplify the CNF encoding of the constraints. A key factor is that considering only a small fragment of a constraint model at one...
متن کاملCompiling Finite Domain Constraints to SAT with BEE: the Director's Cut
BEE is a compiler which facilitates solving finite domain constraints by encoding them to CNF and applying an underlying SAT solver. In BEE constraints are modeled as Boolean functions which propagate information about equalities between Boolean literals. This information is then applied to simplify the CNF encoding of the constraints. We term this process equi-propagation. A key factor is that...
متن کاملCompiling finite domain constraints to SAT with BEE
We present BEE, a compiler which enables to encode finite domain constraint problems to CNF. Using BEE both eases the encoding process for the user and also performs transformations to simplify constraints and optimize their encoding to CNF. These optimizations are based primarily on equi-propagation and on partial evaluation, and also on the idea that a given constraint may have various possib...
متن کاملThe Seventeenth International Conference on Principles and Practice of Constraint Programming ( CP 2011 ) Doctoral Program
s of Papers in the Main CP 2011 Conference A constraint based approach to cyclic RCPSP . . . . . . . . . . . . . . . . . . . . . . . . . . . . 97 Alessio Bonfietti, Michele Lombardi, Michela Milano and Luca Benini Solving MAXSAT by Solving a Sequence of Simpler SAT Instances . . . . . . . . . . . . . . . . 98 Jessica Davies and Fahiem Bacchus Filtering Algorithms for Discrete Cumulative Problem...
متن کاملA Translation of Pseudo Boolean Constraints to SAT
This paper introduces a new CNF encoding of pseudo-Boolean constraints, which allows unit propagation to maintain generalized arc consistency. In the worst case, the size of the produced formula can be exponentially related to the size of the input constraint, but some important classes of pseudo-Boolean constraints, including Boolean cardinality constraints, are encoded in polynomial time and ...
متن کامل